Lion optimization algorithm for team orienteering problem with time window
نویسندگان
چکیده
<span>Over the last decade, many nature-inspired algorithms have been received considerable attention among practitioners and researchers to handle several optimization problems. Lion algorithm (LA) is inspired by a distinctive lifestyle of lions their collective behavior in social groups. LA has presented as powerful solve various In this paper, proposed investigate its performance solving one most popular widespread real-life problems called team orienteering problem with time windows (TOPTW). However, any population-based metaheuristic, very efficient exploring search space, but inefficient exploiting it. So, paper proposes enhancing tackle TOPTW utilizing strong ability explore space improving exploitation ability. This enhancement achieved via process territorial defense generate trespass nomadic lion prevail pride fighting males. As result process, an enhanced (ILA) emerged. The obtained solutions compared best known standard results former studies. conducted experimental test verifies effectiveness ILA it competitive state-of-the-art methods across all tested instances.</span>
منابع مشابه
The Team Orienteering Problem with Capacity Constraint and Time Window
The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a t...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملDiscrete particle swarm optimization for the team orienteering problem
In this paper, a novel discrete particle swarm optimization (PSO) algorithm is proposed to solve the team orienteering problem (TOP). Discrete evaluation is achieved by redefining all operators and operands used in PSO. To obtain better results, a strengthened PSO, which improves both exploration and exploitation during the search process, is employed. Our algorithm achieves the best known solu...
متن کاملAn effective PSO-inspired algorithm for the team orienteering problem
The team orienteering problem (TOP) is a particular vehicle routing problem in which the aim is to maximize the profit gained from visiting customers without exceeding a travel cost/time limit. This paper proposes a new and fast evaluation process for TOP based on an interval graph model and a Particle Swarm Optimization inspired algorithm (PSOiA) to solve the problem. Experiments conducted on ...
متن کاملThe Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2021
ISSN: ['2502-4752', '2502-4760']
DOI: https://doi.org/10.11591/ijeecs.v21.i1.pp538-545